Asymmetric Evaluations of Erasure and Undetected Error Probabilities
نویسندگان
چکیده
منابع مشابه
Undetected error probabilities of binary primitive BCH codes for both error correction and detection
In this paper, we investigate the undetected error probabilities for bounded-distance decoding of binary primitive BCH codes when they are used for both error correction and detection on a binary symmetric channel. We show that the undetected error probability of binary linear codes can be quite simplified and quantified if weight distribution of the code is binomial-like. We obtain bounds on t...
متن کاملBounds on the undetected error probabilities of linear codes for both error correction and detection
The (n, k , d 2 2t + 1) binary linear codes are studied, which are used for correcting error patterns of weight at most t and detecting other error patterns over a binary symmetric channel. In particular, for t = 1, it is shown that there exists one code whose probability of undetected errors is upper bounded by (n + 1]2"-k n ] l when used on a binary symmetric channel with transition probabili...
متن کاملConcerning a Bound on Undetected Error Probability
In the past, it has generally been assumed that the prohability of undetected error for an (n,k) block code, used solely for error detection on a binary symmetric channel, is upperbounded by 2-‘“-k’. In this correspondence, it is shown that Hamming codes do indeed obey this bound, but that the bound is violated by some more general codes. Examples of linear, cyclic, and Bose-Chaudhuri-Hocquengh...
متن کاملUndetected Error Probability for Quantum Codes
Abstract From last fourteen years the work on undetected error probability for quantum codes has been silent. The undetected error probability has been discussed by Ashikhmin [3] in which it was proved that the average probability of undetected error for a given code is essentially given by a function of its weight enumerators. In this paper, new upper bounds on undetected error probability for...
متن کاملCharacterizations of Network Error Correction/Detection and Erasure Correction
In classical algebraic coding theory, the minimum distance of block code completely determines the ability of the code in terms of error correction/detection and erasure correction. We have obtained generalizations of these results for network codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2015
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2015.2495258